A compact compound sinusoidal differential evolution algorithm for solving optimisation problems in memory-constrained environments

نویسندگان

چکیده

In this paper, a new compact algorithm is proposed. Two sinusoidal formulas are used to automatically adjust the crossover rate and mutation scaling factor in Differential Evolution (cDE) metaheuristic. The proposed algorithm, called Compound Sinusoidal cDE, CScDE, compared seven state-of-the-art algorithms on well-known BBOB test-bed, CEC-2014 test suite for continuous optimisation, as well five real-world optimisation problems chosen from CEC-2011 benchmarks. CScDE outperformed its competitors most problem categories over dimensions. It also some well-established population-based metaheuristics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrating Differential Evolution Algorithm with Modified Hybrid GA for Solving Nonlinear Optimal Control Problems

‎Here‎, ‎we give a two phases algorithm based on integrating differential evolution (DE) algorithm with modified hybrid genetic algorithm (MHGA) for solving the associated nonlinear programming problem of a nonlinear optimal control problem‎. ‎In the first phase‎, ‎DE starts with a completely random initial population where each individual‎, ‎or solution‎...

متن کامل

Modified Constrained Differential Evolution for Solving Nonlinear Global Optimization Problems

Nonlinear optimization problems introduce the possibility of multiple local optima. The task of global optimization is to find a point where the objective function obtains its most extreme value while satisfying the constraints. Some methods try to make the solution feasible by using penalty function methods, but the performance is not always satisfactory since the selection of the penalty para...

متن کامل

Differential Evolution for optimisation in dynamic environments

Created in 1994, Differential Evolution (DE) is relatively new but already has been proven to perform well for optimisation in static environments. But with many realworld optimisation problems having non-static environments, how well can DE perform in these situations? What changes can be done to allow DE to perform better in dynamic environments?

متن کامل

Disturbed Exploitation compact Differential Evolution for limited memory optimization problems

This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a rand...

متن کامل

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Expert Systems With Applications

سال: 2021

ISSN: ['1873-6793', '0957-4174']

DOI: https://doi.org/10.1016/j.eswa.2021.115705